Auctioning divisible goods
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
Auctioning a cake: truthful auctions of heterogeneous divisible goods
We consider the problem of auctioning a one-dimensional continuously-divisible heterogeneous good (a.k.a.“the cake”) among multiple agents. Applications include auctioning of time intervals, e.g. auctioning time for usage of a shared device, auctioning TV commercial slots, and more. Different agents may have different valuations for the different possible intervals, and the goal is to maximize ...
متن کاملAn efficient Nash-implementation mechanism for network resource allocation
We propose a mechanism for auctioning bundles of multiple divisible goods in a network where buyers want the same amount of bandwidth on each link in their route. Buyers can specify multiple routes (corresponding to a source–destination pair). The total flow can then be split among thesemultiple routes. We first propose a one-sided VCG-type mechanism. Players do not report a full valuation func...
متن کاملAn Efficient Nash-Implementation Mechanism for Divisible Resource Allocation
We propose a mechanism for auctioning bundles of multiple divisible goods. Such a mechanism is very useful for allocation of bandwidth in a network where the buyers want the same amount of bandwidth on each link in their route. We allow for buyers to specify multiple routes (corresponding to a source-destination pair). The total flow can then be split among these multiple routes. We first propo...
متن کاملThesis Proposal: Fair Division
Fairly dividing goods among several (possibly strategic) parties is a common problem both in economics and computer science. For instance, a government may wish to divide tracts of land to various organizations or a cloud computing environment may wish to divide computing time among several users. Often, such situations are dealt with via the use of monetary transfers — such as in auctioning of...
متن کاملOptimization Decision Method for Procuring Divisible Goods
The procurement decision problem of divisible goods is investigated, and an optimization decision method for procuring a kind of divisible goods (such as coal, oil, electricity, gas, etc.) is presented based on multi-attribute auction. Firstly, the procurement decision problem of divisible goods is converted into a multi-attribute auction of divisible goods. Correspondingly, several important a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008